Quantum context-aware recommendation systems based on tensor singular value decomposition

نویسندگان

چکیده

In this paper, we propose a quantum algorithm for recommendation systems which incorporates the contextual information of users to personalized recommendation. The preference is encoded in third-order tensor dimension N can be approximated by truncated singular value decomposition (t-svd) subsample tensor. Unlike classical that reconstructs using t-svd, our obtains recommended product under certain context measuring output state corresponding an approximation user’s dynamic preferences. achieves time complexity $$\mathcal {O}(\sqrt{k}N\mathrm{polylog}(N))$$ , compared counterpart with {O}(kN^3)$$ where k tubal rank.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Tensor Approximation Algorithm based on High Order Singular Value Decomposition

To solve some problems which JPEG compression obtains results of poor reconstruction quality and high computational complexity for image containing more high frequency information, a novel tensor approximation algorithm based on high order singular value decomposition has been proposed. The new algorithm respects each image both gray image and color image as a high order tensor. It transforms t...

متن کامل

Temporal-Aware QoS-Based Service Recommendation using Tensor Decomposition

The number of services on the Internet is growing rapidly. Thus, the problem of selecting proper services for most users becomes serious and service recommendation is widely needed. Besides functions, QoS information is also an important factor to be considered when making recommendations to users. However, QoS changes with time. To address and solve these challenges, this paper proposes a temp...

متن کامل

A Randomized Tensor Train Singular Value Decomposition

The hierarchical SVD provides a quasi-best low rank approximation of high dimensional data in the hierarchical Tucker framework. Similar to the SVD for matrices, it provides a fundamental but expensive tool for tensor computations. In the present work we examine generalizations of randomized matrix decomposition methods to higher order tensors in the framework of the hierarchical tensors repres...

متن کامل

Context-Aware Recommendation Based On Review Mining

Recommender systems are important building blocks in many of today’s e-commerce applications including targeted advertising, personalized marketing and information retrieval. In recent years, the importance of contextual information has motivated many researchers to focus on designing systems that produce personalized recommendations in accordance with the available contextual information of us...

متن کامل

پیشنهاد روش جدیدی برای محاسبه polynomial singular value decomposition ) psvd )

در این پایان نامه به معرفی روشهای مختلف محاسبه psvd می پردازیم. بخشی از این روشها به بررسی روشهای مختلف محاسبه psvd در مقالات مطالعه شده می پردازد که می توان به محاسبهpsvd با استفاده از الگوریتمهای pqrd و pevd و sbr2 و محاسبه psvd براساس تکنیک kogbetliantz و روش پارامتریک برای محاسبه psvd اشاره نمود. بخش بعدی نیز به بررسی روشهای مستقیم پیشنهادی محاسبه psvd برای ماتریسهای 2×2و2× n و n×2 و 3× n و...

15 صفحه اول

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Quantum Information Processing

سال: 2021

ISSN: ['1573-1332', '1570-0755']

DOI: https://doi.org/10.1007/s11128-021-03131-y